A parallel Poisson generator using parallel prefix
نویسندگان
چکیده
منابع مشابه
Parallel computing using the prefix problem
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd parallel computing using the prefix problem that can be a new way to explore the know...
متن کاملParallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms. The best known sequential algorithms solve these problems in O(mn) time and O(m + n) space, where m and n are the lengths...
متن کامل4 Parallel Prefix Adder
VLSI Integer adders find applications in Arithmetic and Logic Units (ALUs), microprocessors and memory addressing units. Speed of the adder often decides the minimum clock cycle time in a microprocessor. The need for a Parallel Prefix Adder (PPA) is that it is primarily fast when compared with a ripple carry adder. PPA is a family of adders derived from the commonly known carry look ahead adder...
متن کاملComputation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملCyclic Segmented Parallel Prefix
The cyclic segmented parallel prefix (CSPP) circuit is a varation on parallel prefix. Whereas ordinary parallel prefix computes prefix sums of a vector from the beginning, CSPP allows the starting point to move arbitrarily, with the data “wrapping around.” The wraparound is widely useful. We have used CSPP to redesign many components of a superscalar processor to run in time logarithmic in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00204-9